全文获取类型
收费全文 | 3934篇 |
免费 | 854篇 |
国内免费 | 785篇 |
专业分类
电工技术 | 125篇 |
综合类 | 430篇 |
化学工业 | 36篇 |
金属工艺 | 19篇 |
机械仪表 | 109篇 |
建筑科学 | 39篇 |
矿业工程 | 42篇 |
能源动力 | 15篇 |
轻工业 | 20篇 |
水利工程 | 35篇 |
石油天然气 | 20篇 |
武器工业 | 16篇 |
无线电 | 497篇 |
一般工业技术 | 89篇 |
冶金工业 | 15篇 |
原子能技术 | 6篇 |
自动化技术 | 4060篇 |
出版年
2024年 | 14篇 |
2023年 | 59篇 |
2022年 | 101篇 |
2021年 | 114篇 |
2020年 | 132篇 |
2019年 | 114篇 |
2018年 | 123篇 |
2017年 | 169篇 |
2016年 | 190篇 |
2015年 | 243篇 |
2014年 | 341篇 |
2013年 | 232篇 |
2012年 | 365篇 |
2011年 | 407篇 |
2010年 | 342篇 |
2009年 | 333篇 |
2008年 | 388篇 |
2007年 | 354篇 |
2006年 | 255篇 |
2005年 | 225篇 |
2004年 | 229篇 |
2003年 | 134篇 |
2002年 | 138篇 |
2001年 | 114篇 |
2000年 | 83篇 |
1999年 | 54篇 |
1998年 | 54篇 |
1997年 | 58篇 |
1996年 | 26篇 |
1995年 | 28篇 |
1994年 | 32篇 |
1993年 | 28篇 |
1992年 | 13篇 |
1991年 | 11篇 |
1990年 | 8篇 |
1989年 | 8篇 |
1988年 | 4篇 |
1987年 | 4篇 |
1986年 | 7篇 |
1985年 | 9篇 |
1984年 | 3篇 |
1983年 | 4篇 |
1982年 | 7篇 |
1981年 | 6篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1978年 | 3篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有5573条查询结果,搜索用时 15 毫秒
1.
Edge Computing is one of the radically evolving systems through generations as it is able to effectively meet the data saving standards of consumers, providers and the workers. Requisition for Edge Computing based items have been increasing tremendously. Apart from the advantages it holds, there remain lots of objections and restrictions, which hinders it from accomplishing the need of consumers all around the world. Some of the limitations are constraints on computing and hardware, functions and accessibility, remote administration and connectivity. There is also a backlog in security due to its inability to create a trust between devices involved in encryption and decryption. This is because security of data greatly depends upon faster encryption and decryption in order to transfer it. In addition, its devices are considerably exposed to side channel attacks, including Power Analysis attacks that are capable of overturning the process. Constrained space and the ability of it is one of the most challenging tasks. To prevail over from this issue we are proposing a Cryptographic Lightweight Encryption Algorithm with Dimensionality Reduction in Edge Computing. The t-Distributed Stochastic Neighbor Embedding is one of the efficient dimensionality reduction technique that greatly decreases the size of the non-linear data. The three dimensional image data obtained from the system, which are connected with it, are dimensionally reduced, and then lightweight encryption algorithm is employed. Hence, the security backlog can be solved effectively using this method. 相似文献
2.
针对现有图形模糊聚类算法合理性差和抗噪能力弱的问题,提出嵌入对称正则项的图形模糊聚类鲁棒算法。将样本聚类所对应的中立度与拒分度相结合构造对称正则项,嵌入现有图形模糊聚类所对应的目标函数;同时,利用像素邻域所对应的均值信息辅助当前像素聚类并构造了空间信息约束正则项,采用拉格朗日乘子法获得正则化图形模糊聚类鲁棒分割算法。不同噪声干扰图像分割结果表明,所建议的分割算法是有效的,相比现有的鲁棒模糊聚类分割算法具有更强的抑制噪声能力。 相似文献
3.
采用中红外光谱结合化学计量学的方法对车用保险杠碎片进行鉴别,分别对52个车用保险杠碎片样本的全波段光谱数据、指纹区光谱数据和主成分分析降维后的光谱数据建立Fisher判别分析和K近邻算法2种分类模型,并对分类结果进行比较。结果表明,主成分分析提取特征变量后构建的分类模型,分类的准确率更高,对聚丙烯(PP)、PP/滑石粉、PP/滑石粉/碳酸钙(CaCO3)3种类型的样本分类准确率达到92.3 %,对PP/滑石粉类型中的10种品牌样本分类准确率达到88.9 %,分类结果理想;在构建的2种分类模型中,Fisher判别分析模型的分类率远高于K近邻算法模型,分析认为K近邻算法模型受到样本不均衡的影响;中红外光谱结合化学计量学可以实现对车用保险杠碎片的准确区分,且满足快速、无损的检验要求。 相似文献
4.
Somnath Karmakar 《Polycyclic Aromatic Compounds》2019,39(2):159-171
Eigensolutions of {X( = C,B,N),Y( = C,B,N)}-cyclacene graphs with next nearest neighbor (nnn) interactions have been obtained in analytical forms by adapting n-fold rotational symmetry followed by two-fold rotational symmetry (or a plane of symmetry). Expressions of eigensolution indicate the subspectral relationship among such cyclacenes with an even number of hexagonal rings e.g., eigenvalues of {X,Y}-di-cyclacene are found in the eigenspectra of all such even cyclacenes. Total π-electron energies and highest occupied molecular orbital and lowest unoccupied molecular orbital (HOMO–LUMO) gaps are calculated using the analytical expressions obtained and are found to vary negligibly with the variation of nnn interactions in such cyclacenes. Total π-electron energy is found to increase due to increase in restriction intensity of nnn interactions, whereas the HOMO–LUMO gap of polyacenecs having the even number of hexagonal rings and with one electron at each site (atom) decreases with increase in the restriction intensity since such systems contain degenerate half-filled HOMO (bonding or nonbonding) that are much more vulnerable for perturbations imposed through nnn interactions. 相似文献
5.
针对基于位置服务中连续查询情况下,用户自身属性信息很容易被攻击者获取,并通过关联获得用户位置隐私的情况,提出了一种利用粒子群聚类加速相似属性用户寻找,并由相似属性匿名实现用户位置泛化的隐私保护方法。该方法利用位置隐私保护中常用的可信中心服务器,通过对发送到中心服务器中的查询信息进行粒子群属性聚类,在聚类的过程中加速相似属性用户的寻找过程,由相似属性用户完成位置泛化,以此实现位置隐私保护。实验结果证明,这种基于粒子群属性聚类的隐私保护方法具有高于同类算法的隐私保护能力,以及更快的计算处理速度。 相似文献
6.
In this paper we demonstrate that it is possible to enrich query answering with a short data movie that gives insights to the original results of an OLAP query. Our method, implemented in an actual system, CineCubes, includes the following steps. The user submits a query over an underlying star schema. Taking this query as input, the system comes up with a set of queries complementing the information content of the original query, and executes them. For each of the query results, we execute a set of highlight extraction algorithms that identify interesting patterns and values in the data of the results. Then, the system visualizes the query results and accompanies this presentation with a text commenting on the result highlights. Moreover, via a text-to-speech conversion the system automatically produces audio for the constructed text. Each combination of visualization, text and audio practically constitutes a movie, which is wrapped as a PowerPoint presentation and returned to the user. 相似文献
7.
The multi-index hashing (MIH) is the state-of-the-art method for indexing binary codes. However, it is based on the dataset codes uniform distribution assumption, and will lower efficiency in dealing with non-uniformly distributed codes. In this paper, we propose a data-oriented multi-index hashing method. We first compute the correlations between bits and learn adaptive projection vector for each binary substring. Then, instead of using substrings as direct indices into hash tables, we project them with corresponding projection vectors to generate new indices. With adaptive projection, the indices in each hash table are nearly uniformly distributed. Besides, we put forward an entropy based measurement to evaluate the distribution of data items in each hash table. Experiments conducted on reference large scale datasets show that compared to the MIH the time performance of our method can be 36.9%~87.4% better . 相似文献
8.
The generic model query language GMQL is designed to query collections of conceptual models created in arbitrary graph-based modelling languages. Querying conceptual models means searching for particular model subgraphs that comply with a predefined pattern query. Such a query specifies the structural and semantic properties of the model fragment to be returned. In this paper, we derive requirements for a generic model query language from the literature and formally specify the language’s syntax and semantics. We conduct an analysis of GMQL׳s theoretical and practical runtime performance concluding that it returns query results within satisfactory time. Given its generic nature, GMQL contributes to a broad range of different model analysis scenarios ranging from business process compliance management to model translation and business process weakness detection. As GMQL returns results with acceptable runtime performance, it can be used to query large collections of hundreds or thousands of conceptual models containing not only process models, but also data models or organizational charts. In this paper, we furthermore evaluate GMQL against the backdrop of existing query approaches thereby carving out its advantages and limitations as well as pointing toward future research. 相似文献
9.
10.
专家发现是实体检索领域的一个研究热点,针对经典专家发现模型存在索引术语独立性假设与检索性能低的缺陷,提出一种基于贝叶斯网络模型的专家发现方法。该方法模型采用四层网络结构,能够实现图形化的概率推理,同时运用词向量技术能够实现查询术语的语义扩展。实验结果显示该模型在多个评价指标上均优于经典专家发现模型,能够有效实现查询术语语义扩展,提高专家检索性能。 相似文献